1855B - Longest Divisors Interval - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 100001
const int mod = 1e9 + 7;

void solve(){
 int n;
  cin >> n;
   for(int i=1;i<=1000;i++){
       if(n%i){
        cout<<i-1<<'\n';
        return;
       }
   } 
}


 
int32_t  main()
{
 ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin>>t;
    while(t--){
    solve();
    }
    return 0;
}